Highly excited strings I: Generating function

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Generating Independent Random Strings

It is shown that from two strings that are partially random and independent (in the sense of Kolmogorov complexity) it is possible to effectively construct polynomially many strings that are random and pairwise independent. If the two initial strings are random, then the above task can be performed in polynomial time. It is also possible to construct in polynomial time a random string, from two...

متن کامل

Highly Excited Friedmann Universe

A highly excited Friedmann universe filled with a scalar field and radiation has been considered. On the basis of a direct solution to the quantum-mechanical problem with a well-defined time variable, it has been shown that such a universe can have features (energy density, scale factor, Hubble constant, density parameter, matter mass, equivalent number of baryons, age, dimensions of large-scal...

متن کامل

Counting Strings with Given Elementary Symmetric Function Evaluations I: Strings over Zp with p Prime

Let α be a string over Zp with p prime. The j-th elementary symmetric function evaluated at α is denoted Tj(α). We study the cardinalities Sp(n; τ1, τ2, . . . , τt) of the set of length n strings for which Ti(α) = τi. The profile 〈k0, k1, . . . , kp−1〉 of a string α is the sequence of frequencies with which each letter occurs. The profile of α determines Tj(α), and hence Sp. Let fn : Zp−1 pn 7→...

متن کامل

Generating Strings by Replication: a Simple Case

We consider the following new way of generating a language: start with a string w and a given set of insertion contexts (u; v); if uv appears as a substring of w, then we can insert in between u and v any substring of w which starts with v and ends with u (hence preserving the link restriction encoded by (u; v)); iterating this operation, we get a language. Many variants can be imagined, concer...

متن کامل

On Morphisms Generating Run-Rich Strings

A run in a string is a periodic substring which is extendable neither to the left nor to the right with the same period. Strings containing many runs are of interest. In this paper, we focus on the series of strings {ψ(φ(a))}i≥0 generated by two kinds of morphisms, φ : {a, b, c} → {a, b, c}∗ and ψ : {a, b, c} → {0, 1}∗. We reveal a simple morphism φr plays a critical role to generate run-rich s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nuclear Physics B

سال: 2017

ISSN: 0550-3213

DOI: 10.1016/j.nuclphysb.2016.12.022